Probabilistic Interface Automata
نویسندگان
چکیده
منابع مشابه
Interface Automata with Complex Actions: Limiting Interleaving in Interface Automata
Many formalisms use interleaving to model concurrency. To describe some system behaviours appropriately, we need to limit interleaving. For example, in a component-based system, we might wish to limit interleaving to force the inputs to a method to arrive together in order. In Web services, the arrival of XML messages consisting of multiple simple parts should not be interleaved with the behavi...
متن کاملProbabilistic Reversible Automata and Quantum Automata
To study relationship between quantum finite automata and probabilistic finite automata, we introduce a notion of probabilistic reversible automata (PRA, or doubly stochastic automata). We find that there is a strong relationship between different possible models of PRA and corresponding models of quantum finite automata. We also propose a classification of reversible finite 1-way automata.
متن کاملProbabilistic Weighted Automata
Nondeterministic weighted automata are finite automata with numerical weights on transitions. They define quantitative languages L that assign to each word w a real number L(w). The value of an infinite word w is computed as the maximal value of all runs over w, and the value of a run as the maximum, limsup, liminf, limit average, or discounted sum of the transition weights. We introduce probab...
متن کاملProbabilistic Automata with Parameters
Probabilistic automata were introduced by Rabin in early 1960s. We extend this concept by allowing transition probabilities among the states to be parametric. Two main decision problems are considered: the language equivalence and bisimulation of probabilistic automata. One of our main results is a new one sided error Monte Carlo randomized polynomial-time algorithm for the universal equivalenc...
متن کاملOn probabilistic pushdown automata
We study the most important probabilistic computation modes for pushdown automata. First we show that deterministic pushdown automata (pda) are weaker than Las Vegas pda, which in turn are weaker than one-sided-error pda. Next one-sidederror pda are shown to be weaker than (nondeterministic) pda. Finally bounded error two-sided error pda and nondeterministic pda are incomparable. To show the li...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Software Engineering
سال: 2016
ISSN: 0098-5589,1939-3520
DOI: 10.1109/tse.2016.2527000